Adaptive and Personalizing Learning Sequence Using Modified Roulette Wheel Selection Algorithm
نویسنده
چکیده
Prior literature in the field of adaptive and personalized learning sequence in e-learning have proposed and implemented various mechanisms to improve the learning process such as individualization and personalization, but complex to implement due to expensive algorithmic programming and need of extensive and prior data. The main objective of personalizing learning sequence is to maximize learning by dynamically selecting the closest teaching operation in order to achieve the learning competency of learner. In this paper, a revolutionary technique has been proposed and tested to perform individualization and personalization using modified reversed roulette wheel selection algorithm that runs at O(n). The technique is simpler to implement and is algorithmically less expensive compared to other revolutionary algorithms since it collects the dynamic real time performance matrix such as examinations, reviews, and study to form the RWSA single numerical fitness value. Results show that the implemented system is capable of recommending new learning sequences that lessens time of study based on student's prior knowledge and real performance matrix. Keywords—E-learning, fitness value, personalized learning sequence, reversed roulette wheel selection algorithms.
منابع مشابه
Reversed Roulette Wheel Selection Algorithms (RWSA) and Reinforcement Learning (RL) for Personalizing and Improving E-Learning System: The Case Study and Its Implementation
Various mechanisms to improve learning process with the objective of maximizing learning and dynamically selecting the best teaching operation to achieve learning goals have been done in the field of personalized learning. However, instructional strategists have failed to address the necessary corrective measures to remediate immediately learning difficulties. It is necessary that an alternativ...
متن کاملGenetic Algorithm Performance with Different Selection Strategies in Solving TSP
A genetic algorithm (GA) has several genetic operators that can be modified to improve the performance of particular implementations. These operators include parent selection, crossover and mutation. Selection is one of the important operations in the GA process. There are several ways for selection. This paper presents the comparison of GA performance in solving travelling salesman problem (TS...
متن کاملApplication of a Genetic Algorithm to Storm Sewer Network Optimization
In this paper, a genetic algorithm is developed for the optimal design of storm water networks. The nodal elevations of the sewer network are taken as the decision variables. A steady state simulation code is used to analyze the trial solutions provided by the GA optimizer. The performance of the four selection schemes namely, conventional roulette wheel, roulette wheel selection with linear sc...
متن کاملA New Modified Artificial Bee Colony Algorithm with Exponential Function Adaptive Steps
As one of the most recent popular swarm intelligence techniques, artificial bee colony algorithm is poor at exploitation and has some defects such as slow search speed, poor population diversity, the stagnation in the working process, and being trapped into the local optimal solution. The purpose of this paper is to develop a new modified artificial bee colony algorithm in view of the initial p...
متن کاملRoulette-wheel selection via stochastic acceptance
Roulette-wheel selection is a frequently used method in genetic and evolutionary algorithms or in modeling of complex networks. Existing routines select one of N individuals using search algorithms of O(N) or O(logN) complexity. We present a simple roulette-wheel selection algorithm, which typically has O(1) complexity and is based on stochastic acceptance instead of searching. We also discuss ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015